Blame, coercions, and threesomes, precisely
نویسندگان
چکیده
We systematically present four calculi for gradual typing: the blame calculus of Wadler and Findler (2009); a novel calculus that pinpoints blame precisely; the coercion calculus of Henglein (1994); and the threesome calculus of Siek and Wadler (2010). Threesomes are given a syntax that directly exposes their origin as coercions in normal form, a more transparent presentation than that found in Siek and Wadler (2010) or Garcia (2013).
منابع مشابه
A Complement to Blame
Contracts, gradual typing, and hybrid typing all permit less-precisely typed and more-precisely typed code to interact. Blame calculus encompasses these, and guarantees blame safety: blame for type errors always lays with less-precisely typed code. This paper serves as a complement to the literature on blame calculus: it elaborates on motivation, comments on the reception of the work, critiques...
متن کاملThe Good, the Bad, and the Ugly: An Empirical Study of Implicit Type Conversions in JavaScript
Most popular programming languages support situations where a value of one type is converted into a value of another type without any explicit cast. Such implicit type conversions, or type coercions, are a highly controversial language feature. Proponents argue that type coercions enable writing concise code. Opponents argue that type coercions are error-prone and that they reduce the understan...
متن کاملExtending System Fη with Abstraction over Erasable Coercions
Erasable coercions in System Fη, also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in Fη can model subtyping of known types and some displacement of quanti ers, but not subtyping assumptions nor certain form of delayed type instantiation. We generaliz...
متن کاملExtending System Fη with Abstraction over Erasable Coercions
Erasable coercions in System Fη , also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in Fη can model subtyping of known types and some displacement of quantifiers, but not subtyping assumptions nor certain form of delayed type instantiation. We general...
متن کاملCoherence Checking of Coercions in Plastic
Coercive Subtyping is a conceptually simple but powerful framework for subtyping in type theory. Recent work in Durham by Luo et al. on Coercive Subtyping has been partially implemented in the proof assistant`Plastic'. Plastic is an implementation of a variant of Martin-LL of's LF with inductive types, universes, and coercive subtyping. After discussing background theory and then the implementa...
متن کامل